1453B - Suffix Operations - CodeForces Solution

# include <bits/stdc++.h>
# define ll long long
# define vi vector<int>
# define pb push_back
# define ins insert
# define pii pair<int, int>
# define pll pair<long long, long long>
# define fi first
# define se second
# define endl '\n'
# define jess ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

ll t, n, a[200005];

int main() {
    jess;
    cin >> t;
    while(t--) {
        cin >> n;
        ll ans=0;
        for(int i=1; i<=n; i++) {
            cin >> a[i];
            if(i>=2) {
                ans+=abs(a[i]-a[i-1]);
            }
        }
        ll ope=max(abs(a[1]-a[2]), abs(a[n]-a[n-1]));
        for(int i=2; i<n; i++) {
            ope=max(ope, abs(a[i]-a[i-1])+abs(a[i+1]-a[i])-abs(a[i+1]-a[i-1]));
        }
        cout << ans-ope << endl;
    }
}